Example 23 in [ Lucas - IC'06]

Summary: Ex23_Luc06

• TPDB format
• OBJ format
• Positive results:
  1. CSRPO
  2. Polynomial Interpretation
  3. CSDP
  4. Ferreira and Ribeiro's transformation
  5. Giesl and Middeldorp's transformation
  6. Lucas' transformation
  7. Zantema's transformation

Ex23_Luc06 in TPDB format ( Ex23_Luc06.trs):

			
(VAR )
(STRATEGY CONTEXTSENSITIVE 
  (f 1)
  (a)
  (c)
  (g 1)
)
(RULES 
f(f(a)) -> c(f(g(f(a))))
)

The CS-TRS in OBJ format (file Ex23_Luc06.obj):

			
obj Ex23_Luc06 is
  sort S .
  op f : S -> S .
  op a : -> S .
  op c : S -> S [strat (0)] .
  op g : S -> S .
  eq f(f(a)) = c(f(g(f(a)))) .
endo

Positive results

1. The µ-termination of Ex23_Luc06 can be proved by using CSRPO (computed by MuTerm).
   
2. The µ-termination of Ex23_Luc06 can be proved by using a polynomial interpretation with MuTerm.
   
3. The µ-termination of Ex23_Luc06 can be proved by using CSDP (computed by MuTerm).
   
4. The µ-termination of Ex23_Luc06 can be proved by using Ferreira and Ribeiro's transformation. The TRS Ex23_Luc06_FR:

   					
   	f(f(a)) -> c(n__f(n__g(n__f(n__a))))
   	f(X) -> n__f(X)
   	g(X) -> n__g(X)
   	a -> n__a
   	activate(n__f(X)) -> f(activate(X))
   	activate(n__g(X)) -> g(activate(X))
   	activate(n__a) -> a
   	activate(X) -> X
   
   	
   	

   can be proved terminating by AProVE
   
5. The µ-termination of Ex23_Luc06 can be proved by using Giesl and Middeldorp's transformation. The TRS Ex23_Luc06_GM:

   					 
   	a__f(f(a)) -> c(f(g(f(a))))
   	mark(f(X)) -> a__f(mark(X))
   	mark(a) -> a
   	mark(c(X)) -> c(X)
   	mark(g(X)) -> g(mark(X))
   	a__f(X) -> f(X)
   	
   	

   can be proved terminating by AProVE .
   
6. The µ-termination of Ex23_Luc06 can be proved by using Lucas' transformation. The TRS Ex23_Luc06_L:

   					
   	f(f(a)) -> c
   	
   	

   is clearly terminating. A proof can be computed by MuTerm and polynomial interpretation
   
7. The µ-termination of Ex23_Luc06 can be proved by using Zantema's transformation. The TRS Ex23_Luc06_Z:

   					
   	f(f(a)) -> c(n__f(g(f(a))))
   	f(X) -> n__f(X)
   	activate(n__f(X)) -> f(X)
   	activate(X) -> X
   	
   	

   can be proved terminating by MuTerm .